Minimising Deterministic Büchi Automata Precisely Using SAT Solving

We show how deterministic Büchi automata can be fully minimised by reduction to the satisfiability (SAT) problem, yielding the first automated method for this task. Size reduction of such ω-automata is an important step in probabilistic model checking as well as synthesis of finite-state systems. Our experiments demonstrate that state-of-theart SAT solvers are capable of solving the resulting satisfiability problem instances quickly, making the approach presented valuable in practice.